Simulation Environment for Distance based Location Algorithms in Wireless Sensor Networks
نویسندگان
چکیده
In the last years, a remarkable research effort has been made in the area of wireless sensor networks. One of the main advantages of this kind of distributed system is the ability to determine the position of its nodes and the events sensed. Therefore, a simulation framework is required to compare the different location algorithms that could be used in a certain environment, in order to decide which one is the most suitable method for determining the position of a node or target, as well as to identify the weaknesses and strengths of every algorithm. In this paper, we describe a simulation environment, for distance based location algorithms to be used in wireless sensor networks. Key-Words: wireless sensor networks, DoA, location, simulation, Monte Carlo
منابع مشابه
A multi-hop PSO based localization algorithm for wireless sensor networks
A sensor network consists of a large number of sensor nodes that are distributed in a large geographic environment to collect data. Localization is one of the key issues in wireless sensor network researches because it is important to determine the location of an event. On the other side, finding the location of a wireless sensor node by the Global Positioning System (GPS) is not appropriate du...
متن کاملDesign and evaluation of two distributed methods for sensors placement in Wireless Sensor Networks
Adequate coverage is one of the main problems for distributed wireless sensor networks and The effectiveness of that highly depends on the sensor deployment scheme. Given a finite number of sensors, optimizing the sensor deployment will provide sufficient sensor coverage and save power of sensors for movement to target location to adequate coverage. In this paper, we apply fuzzy logic system to...
متن کاملMultiple Target Tracking in Wireless Sensor Networks Based on Sensor Grouping and Hybrid Iterative-Heuristic Optimization
A novel hybrid method for tracking multiple indistinguishable maneuvering targets using a wireless sensor network is introduced in this paper. The problem of tracking the location of targets is formulated as a Maximum Likelihood Estimation. We propose a hybrid optimization method, which consists of an iterative and a heuristic search method, for finding the location of targets simultaneously. T...
متن کاملDesign and evaluation of two distributed methods for sensors placement in Wireless Sensor Networks
Adequate coverage is one of the main problems for distributed wireless sensor networks and The effectiveness of that highly depends on the sensor deployment scheme. Given a finite number of sensors, optimizing the sensor deployment will provide sufficient sensor coverage and save power of sensors for movement to target location to adequate coverage. In this paper, we apply fuzzy logic system to...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملA Novel Comprehensive Taxonomy of Intelligent-Based Routing Protocols in Wireless Sensor Networks
Routing in ad-hoc networks, specifically intelligent-based ones, is a highly interested research topic in recent years. Most of them are simulation-based study. Large percentages have not even mentioned some of the fundamental parameters. This strictly reduces their validity and reliability. On the other hand, there is not a comprehensive framework to classify routing algorithms in wireless sen...
متن کامل